On the geodetic hull number for complementary prisms II

In the geodetic convexity, a set of vertices S graph G is convex if all belonging to any shortest path between two lie in . The hull H ( ) smallest containing If = V ), then cardinality h minimum number complementary prism GḠ arises from disjoint union and Ḡ by adding edges perfect matching corresponding A autoconnected both are connected. Motivated previous work, we study for prisms graphs. When split graph, present lower upper bounds showing that unlimited. other case, when non-split it limited 3.